Iterative Viterbi A* Algorithm for K-Best Sequential Decoding
نویسندگان
چکیده
Sequential modeling has been widely used in a variety of important applications including named entity recognition and shallow parsing. However, as more and more real time large-scale tagging applications arise, decoding speed has become a bottleneck for existing sequential tagging algorithms. In this paper we propose 1-best A*, 1-best iterative A*, k-best A* and k-best iterative Viterbi A* algorithms for sequential decoding. We show the efficiency of these proposed algorithms for five NLP tagging tasks. In particular, we show that iterative Viterbi A* decoding can be several times or orders of magnitude faster than the state-of-the-art algorithm for tagging tasks with a large number of labels. This algorithm makes real-time large-scale tagging applications with thousands of labels feasible.
منابع مشابه
Design and Implementation of Viterbi Decoder Using FPGAs
i ii iii ABSTRACT Convolutional encoding is a forward error correction technique that is used for correction of errors at the receiver end. The two decoding algorithms used for decoding the convolutional codes are Viterbi algorithm and Sequential algorithm. Sequential decoding has advantage that it can perform very well with long constraint length. Viterbi decoding is the best technique for dec...
متن کاملAn Algebraic Decoding Algorithm for Convolutional Codes
The class of convolutional codes generalizes the class of linear block codes in a natural way. The construction of convolutional codes which have a large free distance and which come with an e cient decoding algorithm is a major task. Contrary to the situation of linear block codes there exists only very few algebraic construction of convolutional codes. It is the purpose of this article to int...
متن کاملA Study of Viterbi Decoder Algorithm for Wireless LANs
Viterbi Decoders are commonly used to decode convolutional codes in communications systems. This Viterbi Decoder is a fully parallel implementation which gives fast data throughput. The decoder is targeted for WiMAX and Wireless LAN applications. Input symbol metric pairs are decoded into output data bits by the maximum likelihood Viterbi processor core. Decoder supports both hard and soft inpu...
متن کاملConvolutional Decoders for Amateur Packet Radio
This paper describes two freely available convolutional decoders written in the C language. One implements the Fano algorithm for sequentially decoding three rate l/2 K=32 codes while the other implcmcnts the Viterbi algorithm for maximum likelihood decoding of the rate l/2 K=7 NASA Standard code. Both support 8-W soft-decision decoding with arbitrary metric tables and perform according to theory.
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کامل